Analysis of Malmquist-Takenaka-Christov rational approximations with applications to the nonlinear Benjamin equation
نویسندگان
چکیده
Abstract In the paper, we study approximation properties of Malmquist-Takenaka-Christov (MTC) system. We show that discrete MTC approximations converge rapidly under mild restrictions on functions asymptotic at infinity. This makes them particularly suitable for solving semi- and quasi-linear problems containing Fourier multipliers, whose symbols are not smooth origin. As a concrete application, provide rigorous convergence stability analyses collocation scheme nonlinear Benjamin equation. demonstrate method converges admits an efficient implementation, comparable to best spectral hybrid Fourier/finite-element methods described in literature.
منابع مشابه
Fourier analysis and the Takenaka-Malmquist basis
We consider problems related to the generalization of the classical Fourier basis to a basis of rational functions with prescribed poles outside the unit disk. We give some generalizations about the convergence and estimation of the Fourier coefficients with respect to this generalized basis. We also consider a rational generalization of the classical Toeplitz matrices and consider the asymptot...
متن کاملNumerical and perturbative computations of solitary waves of the Benjamin-Ono equation with higher order nonlinearity using Christov rational basis functions
Computation of solitons of the cubically-nonlinear Benjamin–Ono equation is challenging. First, the equation contains the Hilbert transform, a nonlocal integral operator. Second, its solitary waves decay only as O(1/jxj). To solve the integro-differential equation for waves traveling at a phase speed c, we introduced the artificial homotopy H(uXX) c u + (1 d)u + du = 0, d 2 [0,1] and solved it ...
متن کاملRational invariant subspace approximations with applications
Subspace methods such as MUSIC, Minimum Norm, and ESPRIT have gained considerable attention due to their superior performance in sinusoidal and direction-of-arrival (DOA) estimation, but they are also known to be of high computational cost. In this paper, new fast algorithms for approximating signal and noise subspaces and that do not require exact eigendecomposition are presented. These algori...
متن کاملSolving Burgers' Equation Using Optimal Rational Approximations
Abstra t. We solve vis ous Burger's equation using a fast and a urate algorithm referred to here as the redu tion algorithm for omputing near optimal rational approximations. Given a proper rational fun tion with n poles, the redu tion algorithm omputes (for a desired L ∞ -approximation error) a rational approximation of the same form, but with a (near) optimally small number m ≪ n of poles. Al...
متن کاملAn approximation to the solution of Benjamin-Bona-Mahony-Burgers equation
In this paper, numerical solution of the Benjamin-Bona-Mahony-Burgers (BBMB) equation is obtained by using the mesh-free method based on the collocation method with radial basis functions (RBFs). Stability analysis of the method is discussed. The method is applied to several examples and accuracy of the method is tested in terms of $L_2$ and $L_infty$ error norms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Nonlinear Science and Numerical Simulation
سال: 2021
ISSN: ['1878-7274', '1007-5704']
DOI: https://doi.org/10.1016/j.cnsns.2020.105571